Spring Meeting of Council, May 15-17, 1985 Scottsdale, Arizona, Minutes of Meeting

https://egrove.olemiss.edu/aicpa_assoc/2005/thumbnail.jp

Spring Meeting of Council, Phoenix, Arizona, May 11-13, 1981

https://egrove.olemiss.edu/aicpa_assoc/2000/thumbnail.jp

CPA Client Bulletin, January 1990

https://egrove.olemiss.edu/aicpa_news/4564/thumbnail.jp

Legislative Report, Volume 12, Number 3, March 1979

https://egrove.olemiss.edu/aicpa_news/4877/thumbnail.jp

CPA Client Bulletin, July 1997

https://egrove.olemiss.edu/aicpa_news/4654/thumbnail.jp

Financial Manager\u27s Report, March 1995

https://egrove.olemiss.edu/aicpa_news/2883/thumbnail.jp

Reconfigurable resource scheduling

Multi-core and multi-processor environments are increasingly used to support a wide range of applications. These environments host multiple services simultaneously. The set of processors configured to support a particular service depends upon the associated workload; fluctuations in workload require changes in processor allocation. In these systems, reallocating a processor from one service to another tends to incur a nonnegligible overhead. Motivated by these applications, this dissertation considers a class of scheduling problems that we refer to as reconfiguration resource scheduling. The salient features of this class are as follows: There are jobs of different categories, and resources can be reconfigured to process jobs of a certain category, where a reconfiguration incurs an overhead, in terms of cost or time. In our initial investigation, we study the following subclass of the class of reconfigurable resource scheduling problems. We are given a finite set of resources, each of which has an associated category, and a sequence of requests, each of which is a set of unit jobs. Each job has an associated category, and needs to be executed on a resource of the same category within a specified delay bound of its arrival, or else it is dropped at a specified drop cost. At any time, a resource can be reconfigured to a different category at a specified reconfiguration cost. The goal is to schedule the reconfigurations of the resources, and the executions of the jobs, in a way that minimizes the total cost. We design efficient online algorithms with provably good performance for two main problems in this subclass, one allowing category-specific drop costs, which we refer to as reconfigurable resource scheduling with variable drop costs, and the other allowing category-specific delay bounds, which we refer to as reconfigurable resource scheduling with variable delay bounds. Reconfigurable resource scheduling with variable drop costs is motivated by certain applications in which some jobs are more important than others. We solve this problem using a layered approach, where in each layer we reduce to a scheduling problem defined over a more constrained set of possible inputs. In the first layer, we reduce to the special case in which all job arrivals are batched. In the second layer, we reduce to the special case in which the job arrival rate is limited. In the third layer, we reduce the rate-limited problem to two cases: large reconfiguration cost, and small reconfiguration cost. We use a traffic reshaping technique to smooth out the job arrivals, and thereby reduce the case with large reconfiguration cost to the special case of unit delay, and reduce the case with small reconfiguration cost to the special case of rate-limited unit delay. In the fourth layer, we reduce unit delay with large reconfiguration cost to a caching problem which we refer to as file caching with remote reads, and reduce rate-limited unit delay with small reconfiguration cost to a variant of disk paging problem which we refer to as prefix paging. In the fifth layer, we solve the file caching with remote reads problem by generalizing certain existing work in the area of file caching, and we solve prefix paging using a kind of marking algorithm. Reconfigurable resource scheduling with variable delay bounds is motivated by applications in which jobs are required to be processed within category-specific delay guarantees. Once again, we use a layered approach. The first two layers are analogous to the first two layers in our solution for reconfigurable resource scheduling with variable drop costs, respectively, but are more involved due to the variable delay bounds. In the third layer, we solve the rate-limited problem using a novel combination of the EDF and LRU scheduling principles.Computer Science

20150709: Department of Engineering, 2008

These items include materials from Engineering at Marshall University from 2008. Items were received in 2015 and include notable materials from or about the History of Engineering Department at Marshall University among other support and presentations about Engineering at Marshall and enrollment information. This is not an exhaustive list. Please download the finding aid for a full list of contents

Who or what was the inspiration for choosing your current course of study?

Award winning student essay. This essay won the Student Writing Award Scheme via the HE Academy Subject Network for Information and Computer Sciences

Agent-Based Models and Simulations in Economics and Social Sciences: from conceptual exploration to distinct ways of experimenting

Now that complex Agent-Based Models and computer simulations spread over economics and social sciences - as in most sciences of complex systems -, epistemological puzzles (re)emerge. We introduce new epistemological tools so as to show to what precise extent each author is right when he focuses on some empirical, instrumental or conceptual significance of his model or simulation. By distinguishing between models and simulations, between types of models, between types of computer simulations and between types of empiricity, section 2 gives conceptual tools to explain the rationale of the diverse epistemological positions presented in section 1. Finally, we claim that a careful attention to the real multiplicity of denotational powers of symbols at stake and then to the implicit routes of references operated by models and computer simulations is necessary to determine, in each case, the proper epistemic status and credibility of a given model and/or simulation